An Annealing Memetic Algorithm for Instructional Scheduling
نویسندگان
چکیده
منابع مشابه
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control and other fields where supervision personnel is working. The objective is to assign breaks to employees such that various constraints reflecting legal demands or ergonomic criteria are satisfied and staffing requiremen...
متن کاملA Memetic Algorithm for Parallel Machine Scheduling
This paper focuses on the problem of scheduling a set of independent jobs with setup times and job splitting, on a set of identical parallel machines such that total tardiness is minimized. In this study, it is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on parallel machines. Because the problem is NP-hard, a memetic algorithm (MA) is proposed...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملAn Integrated Model of Project Scheduling and Material Ordering: A Hybrid Simulated Annealing and Genetic Algorithm
This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...
متن کاملA Variation on a Memetic Algorithm for Boiler Scheduling
This paper investigates the optimisation of pressurised steam production for a power plant, via a number of interconnected boilers of varying efficiency characteristics. The aim of the scheme is to provide the required amount of steam whilst allowing sufficient spare capacity to compensate for boiler failure. The proposed solution uses evolutionary techniques based on genetic and memetic algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Emerging Technologies in Learning (iJET)
سال: 2018
ISSN: 1863-0383
DOI: 10.3991/ijet.v13i11.9601